Σ01 and Π01 equivalence structures

نویسندگان

  • Douglas A. Cenzer
  • Valentina S. Harizanov
  • Jeffrey B. Remmel
چکیده

We study computability theoretic properties of 01 and 0 1 equivalence structures and how they di er from computable equivalence structures or equivalence structures that belong to the Ershov di erence hierarchy. This includes the complexity of isomorphisms between 01 equivalence structures and between 01 equivalence structures. Any 0 1 equivalence structure A with in nitely many in nite equivalence classes is isomorphic to a computable structure. On the other hand, there are 01 equivalence structures with nitely many in nite equivalence classes, which are not isomorphic to any computable structure. If 01 equivalence structures A1 and A2 are isomorphic to a computable structure A that is computably categorical or relatively 02 categorical, then A1 and A2 are 0 2 isomorphic. If B is a computably categorical computable equivalence structure and A is a 01 structure which is isomorphic to B, then A and B are 0 2 isomorphic. If B is a computable equivalence structure which is not computably categorical, then in several cases we construct a 01 structure A which is isomorphic to B but is not 02 isomorphic to B. The simplest case is when B consists of in nitely many classes of sizes 1 or 2, and no other classes; if B is 02 categorical, then we show that the 0 1 structure A is moreover not 02 isomorphic to any 0 1 structure. The spectrum question is to determine the possible sets (or degrees of sets) that can compose the elements in equivalence classes of size k, for some xed k, in a computable equivalence structure. For example, for any in nite c.e. set B, there is a computable equivalence structure with in nitely many equivalence classes of size 1, in nitely many classes of size 2, and no other equivalence classes, such that B = fx : card([x]) = 2g. We explore the connection between the complexity of the character (A) and the theory Th(A). If Th(A) is decidable, then the character (A) is computable. If an equivalence structure B has a computable character, then there is a decidable structure A isomorphic to B.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decidability and Universality of Quasiminimal Subshifts

We show that there exists a universal subshift having only a finite number of minimal subsystems, refuting a conjecture in [Delvenne, Kůrka, Blondel, ’05]. We then introduce the still smaller class of quasiminimal subshifts, having finitely many subsystems in total. With N-actions, their theory essentially reduces to the theory of minimal systems, but with Zactions, the class is much larger. We...

متن کامل

Π1 Classes with Complex Elements

An infinite binary sequence is complex if the Kolmogorov complexity of its initial segments is bounded below by a computable function. We prove that a Π01 class P contains a complex element if and only if it contains a wtt-cover for the Cantor set. That is, if and only if for every real Y there is an X in the P such that X >wtt Y . We show that this is also equivalent to the Π01 class’s being l...

متن کامل

Equivalences in Bicategories

In this paper, we establish some connections between the concept of an equivalence of categories and that of an equivalence in a bicategory. Its main result builds upon the observation that two closely related concepts, which could both play the role of an equivalence in a bicategory, turn out not to coincide. Two counterexamples are provided for that goal, and detailed proofs are given. In par...

متن کامل

An equivalence functor between local vector lattices and vector lattices

We call a local vector lattice any vector lattice with a distinguished positive strong unit and having exactly one maximal ideal (its radical). We provide a short study of local vector lattices. In this regards, some characterizations of local vector lattices are given. For instance, we prove that a vector lattice with a distinguished strong unit is local if and only if it is clean with non no-...

متن کامل

Π01 Classes, Peano Arithmetic, Randomness, and Computable Domination

We present an overview of the topics in the title and of some of the key results pertaining to them. These have historically been topics of interest in computability theory and continue to be a rich source of problems and ideas. In particular, we draw attention to the links and connections between these topics and explore their significance to modern research in the field.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 162  شماره 

صفحات  -

تاریخ انتشار 2011